A novel quantum inspired cuckoo search for knapsack problems
نویسندگان
چکیده
منابع مشابه
A novel quantum inspired cuckoo search for knapsack problems
This paper presents a new inspired algorithm called Quantum Inspired Cuckoo Search Algorithm (QICSA). This one is new framework relying on Quantum Computing principles and Cuckoo Search algorithm. The contribution consists in defining an appropriate representation scheme in the cuckoo search algorithm that allows applying successfully on combinatorial optimization problems some quantum computin...
متن کاملA Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems
Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...
متن کاملComparative Study of Cuckoo Inspired Metaheuristics Applying to Knapsack Problems
Cuckoo Optimization Algorithm (COA) and Cuckoo Search Algorithm (CS) are two population-based metaheuristics. They are based on the cuckoo’s behavior in their lifestyle and their characteristics in egg laying and breeding. Both algorithms are proposed for continuous optimization problems. In this paper, we propose a comparative study of COA and CS. For this we have proposed a binary version of ...
متن کاملQuantum inspired cuckoo search algorithm for graph colouring problem
The graph coloring problem (GCP) is one of the most interesting, studied and difficult combinatorial optimization problems. That is why, several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics and hybrid approaches. In this paper, we try to solve the graph coloring problem using a new approach based on the quantum inspired cuc...
متن کاملA novel greedy quantum inspired cuckoo search algorithm for variable sized bin packing problem
Bin packing is a well-known NP-Hard optimization problem which has several real applications. Classical bin packing (BPP) is a simple model where all bins are identical. However, the variable sized bin packing problem (VSBPP) is a generalization of the bin packing problem where bins of different capacities are available for packing a set of items having different weights. The objective is to pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Bio-Inspired Computation
سال: 2011
ISSN: 1758-0366,1758-0374
DOI: 10.1504/ijbic.2011.042260